\chapter*{Notation}
\label{chap:notation}

\begin{table}
 \begin{tabular}{c l}
  \hline
  \textbf{Symbol} & \textbf{Definition}\\
  \hline
  $n$ & Number of customers\\
  $d_{ij}$ & Distance between a pair of customers $i$ and $j$\\
  $E[L_{\tau}]$ & Expected distance of an apriori solution (base sequence) $\tau$\\
  $l$ & Location of vehicle\\
  $q_l$ & Vehicle capacity when customer $l$ has already been served.\\
  $p_i(j)$ & Probability of customer $i$ take the demand value $j$\\
  $K$ & Maximal demand\\
  $\bar{D}_i$ & Maximal demand of customer $i$\\
  $Q$ & Maximal capacity of vehicle\\
%Chapter 3 - Genetic algorithm
  $P_k$ & Evolutionary algorithm generation in the generation $k$.\\
  $I^{P_k}_i$ & Individual $i$ of the population $P_k$.\\
  $\circledast$ & Crossover operator in evolutionary algorithm.\\
  $Prob_m$ & Probability of mutation.\\
  $\Delta^{P_k}_{E'}$ & Rate of fitness improve in the generation $P_k$\\
  $\bar{\Gamma}_{P_k}$ & Best expected distance obtained by an individual in the generation $k$\\
  $\kappa$ & Number of iterations of evolutionary algorithm\\
  $\mathcal{m}$ & Maximun counting of consecutive iterations without significative change.\\
  $\varepsilon$ & Rate bound of significative change.\\
  \hline
 \end{tabular}

\end{table}
